(CUP) Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the th...

Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.

Abstracts and contents. Full text to subscribers.

Aims to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Full text by subscription.

The aim of IPL is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers.

(Academic Press) Contents from vol.14 (1993). Full text to subscribers.

A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999.

(Elsevier) Mathematical results on complexity as broadly conceived.

Editor's site. Author and subscriber information.

Contact information, list of accepted and forthcoming papers.